Coalgebraic Walks, in Quantum and Turing Computation
نویسنده
چکیده
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing machines coalgebraically, namely as controlled ‘walks’ on a tape.
منابع مشابه
The Post‐Modern Transcendental of Language in Science and Philosophy
In this chapter I discuss the deep mutations occurring today in our society and in our culture, the natural and mathematical sciences included, from the standpoint of the “transcendental of language”, and of the primacy of language over knowledge. That is, from the standpoint of the “completion of the linguistic turn” in the foundations of logic and mathematics using Peirce’s algebra of relatio...
متن کاملControl by quantum dynamics on graphs
We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a novel graph-theoretic feature consisting of a particularly disordered cycle structure. Disregarding efficiency of control functions, but choosing subfamilies...
متن کاملMonoidal computer III: A coalgebraic view of computability and complexity
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a high-level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or t...
متن کاملCoalgebraic Semantics for Quantum Computation
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. In this thesis we will present a coalgebraic representation of systems occuring in the field of quantum computation. This will allow us to derive a method to convert quantum mechanical systems into simple...
متن کاملCoalgebraic Quantum Computation
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces. This will allow us to derive a method to conver...
متن کامل